Finite state languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite State Temporality and Context-Free Languages

In the finite-state temporality approach, events in natural language semantics have been characterized in regular languages, with strings representing sequences of temporal observations. We extend this approach to natural language constructions which are not regular. Context-free constructions are detailed and discussed. Superposition, the key operator in the finite-state temporality approach i...

متن کامل

On the average state and transition complexity of finite languages

We investigate the average-case state and transition complexity of deterministic and nondeterministic finite automata, when choosing a finite language of a certain “size” n uniformly at random from all finite languages of that particular size. Here size means that all words of the language are either of length n, or of length at most n. It is shown that almost all deterministic finite automata ...

متن کامل

Finite-state morphological transducers for three Kypchak languages

This paper describes the development of free/open-source finite-state morphological transducers for three Turkic languages—Kazakh, Tatar, and Kumyk—representing one language from each of the three commonly distinguished subbranches of the Kypchak branch of Turkic. The finite-state toolkit used for the work is the Helsinki Finite-State Toolkit (HFST). This paper describes how the development of ...

متن کامل

Finite-State Registered Automata and Their Uses in Natural Languages

We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expressions denote arbitrary FSRAs and use it to describe some morphological and phonological phenomena. We also define several dedicated operators which support an easy and efficient implementation of some non-trivial morph...

متن کامل

The Average State Complexity of Rational Operations on Finite Languages

Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations are asymptotically linear.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1958

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(58)90082-2